منابع مشابه
P-adic Valuations and K-regular Sequences
Abstract A sequence is said to be k-automatic if the nth term of this sequence is generated by a finite state machine with n in base k as input. Regular sequences were first defined by Allouche and Shallit as a generalization of automatic sequences. Given a prime p and a polynomial f(x) ∈ Qp[x], we consider the sequence {vp(f(n))}n=0, where vp is the p-adic valuation. We show that this sequence...
متن کاملEfficiency Measurement via Revealed Thresholds, Without Knowing Valuations
Laboratory experiments employing an induced-values methodology often report on allocative efficiencies observed. That methodology requires experimenters know subjects’ motivations precisely, questionable in labs, impossible in field experiments. Allocative efficiency implies a hypothetical costless aftermarket would be inactive. An allocation mechanism’s outcome is defined to be behaviorally ef...
متن کاملCombinatorial Auctions with k-wise Dependent Valuations
We analyze the computational and communication complexity of combinatorial auctions from a new perspective: the degree of interdependency between the items for sale in the bidders’ preferences. Denoting by Gk the class of valuations displaying up to k-wise dependencies, we consider the hierarchy G1 ⊂ G2 ⊂ · · · ⊂ Gm, where m is the number of items for sale. We show that the minimum non-trivial ...
متن کاملSatisfiability Thresholds beyond k -XORSAT
We consider random systems of equations x1 + · · · + xk = a, 0 ≤ a ≤ 2 which are interpreted as equations modulo 3. We show for k ≥ 15 that the satisfiability threshold of such systems occurs where the 2−core has density 1. We show a similar result for random uniquely extendible constraints over 4 elements. Our results extend previous results of Dubois/Mandler for equations mod 2 and k = 3 and ...
متن کاملThresholds in Random Graphs and k-sat
In their seminal work [6],[7], Erdos and Renyi invented the notion of random graphs and made the fundamental observation that when the parameter controlling the edge probability varies, the random system undergoes a dramatic and swift qualitative change. “Much like water that freezes abruptly as its temperature drops below zero the structure of the random graph quickly changes from a primordial...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2020
ISSN: 0001-8708
DOI: 10.1016/j.aim.2020.107062